Comparing classification tree structures: a special case of comparing q-ary relations

Comparing classification tree structures: A special case of comparing q-ary relations II

Comparing q-ary relations on a set O of elementary objects is one of the most fundamental problems of classiication and combinatorial data analysis. In this paper the speciic comparison task that involves classiication tree structures (binary or not) is considered in this context. Two mathematical representations are proposed. One is deened in terms of a weighted binary relation; the second use...

Comparing classification tree structures : a special case of comparing q-ary relations

Comparing Classification Results between N-ary and Binary Problems

Many quality measures for rule discovery are binary measures, they are designed to rate binary rules (rules which separate the database examples into two categories eg. “it is a bird” vs. “it is not a bird”) and they cannot rate N -ary rules (rules which separate the database examples into N categories eg. “it is a bird” or “it is an insect” or “it is a fish”). Many quality measures for classif...

Comparing Classifiers for (a special case of) Transition-Based Parsing

Transition-based parsing has proven to be very competitive. Part of the reason for this is that with respect to machine learning the parsing reduces to multi-class classification. This allows the use of very powerful machine learning algorithms such as Support Vector Machines. If we can find an even better classifier we would expect better parsing results. We will therefore try out different cl...

Comparing Consequence Relations

The technical problem addressed in this paper is, given two rule systems for consequence relations X and Y, how to construct Y-approximations of a given X-relation. While an upper Yapproximation can be easily constructed if all Yrules are Horn, the construction of lower Yapproximations is less straightforward. We address the problem by defining the notion of coclosure under co-Horn rules, that ...